Stochastic local search with learning automaton for the swap-body vehicle routing problem
نویسندگان
چکیده
منابع مشابه
A Heuristic Approach for the Swap-Body Vehicle Routing Problem
The Swap-Body Vehicle Routing Problem is a variant of the well-studied vehicle routing problem which incorporates additional complicating factors encountered in practice. In this problem, a homogeneous fleet of an unlimited number of trucks, semitrailers, and swap-bodies are used to serve a set of customers. Some customers may only be served by trucks due to a set of location-dependent accessib...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملThe Stochastic Vehicle Routing Problem
1. Summary 2 1.1 Uncertainty of input parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Availability of input parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Commodity handling patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Classification of methods . . . . . . . . . . . . . ....
متن کاملCuckoo search via Lévy flights for the capacitated vehicle routing problem
For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2018
ISSN: 0305-0548
DOI: 10.1016/j.cor.2017.08.002